Least squares one-class support vector machine on fuzzy set
نویسندگان
چکیده
منابع مشابه
Least Squares One-class Support Vector Machine on Fuzzy Set
In this paper, we formulate a least squares version of the one-class support vector fuzzy machine (LS one-class SVFM) which is combined with the fuzzy set theory. The parameters in the proposed algorithm, such as weight vector and bias term, are fuzzy numbers. Our model only needs to solve a system of linear equations, instead of a complex quadratic programming problem (QPP) solved in one-class...
متن کاملLeast Squares Support Vector Machine for Constitutive Modeling of Clay
Constitutive modeling of clay is an important research in geotechnical engineering. It is difficult to use precise mathematical expressions to approximate stress-strain relationship of clay. Artificial neural network (ANN) and support vector machine (SVM) have been successfully used in constitutive modeling of clay. However, generalization ability of ANN has some limitations, and application of...
متن کاملLeast Squares Fuzzy One-class Support Vector Machine for Imbalanced Data
Based on fuzzy one-class support vector machine (SVM) and least squares (LS) oneclass SVM, we propose an LS fuzzy one-class SVM to deal with the class imbalanced problem. The LS fuzzy one-class SVM applies a fuzzy membership to each sample and attempts to solve the modified primal problem. Hence, we just need to solve a system of linear equations as opposed solving the quadratic programming pro...
متن کاملLeast Squares Twin Support Vector Machine for Multi-Class Classification
Twin support vector machine (TWSVM) was initially designed for binary classification. However, real-world problems often require the discrimination more than two categories. To tackle multi-class classification problem, in this paper, a multiple least squares twin support vector machine is proposed. Our Multi-LSTSVM solves K quadratic programming problems (QPPs) to obtain K hyperplanes, each pr...
متن کاملSparse least squares Support Vector Machine classifiers
In least squares support vector machine (LS-SVM) classi-ers the original SVM formulation of Vapnik is modiied by considering equalit y constraints within a form of ridge regression instead of inequality constraints. As a result the solution follows from solving a set of linear equations instead of a quadratic programming problem. Ho wever, a d r a wback is that sparseness is lost in the LS-SVM ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Control and Automation
سال: 2016
ISSN: 2005-4297,2005-4297
DOI: 10.14257/ijca.2016.9.12.21